The Complexity of Computing all Subfields of an Algebraic Number Field
نویسندگان
چکیده
For a finite separable field extension K/k, all subfields can be obtained by intersecting so-called principal subfields ofK/k. In this work we present a way to quickly compute these intersections. If the number of subfields is high, then this leads to faster run times and an improved complexity.
منابع مشابه
Dosimetric outcomes of the breast field-in-field (FIF) radiotherapy technique in patients with mastectomy and lumpectomy surgeries
Background: Field-in-field (FIF) technique for treatment of breast cancer has become a widely performed method over the recent years. However, there was no study in the application of FIF technique in patients with breast cancer undergoing mastectomy and lumpectomy. This study is an attempt to compare dosimetric outcomes after applying the FIF technique in these patients. Materials and Methods:...
متن کاملبررسی حضور علوم اعصاب ایران در پایگاه ISI بر اساس شاخصهای علم سنجی
Introduction: The purpose of this study was to analyze Iran's scientific status of neuroscience field in citation indexes between 2002 and 2008. Methods: In this descriptive survey, Web of Science (WOS) database was used for data collection. The Data were gathered from the subject areas of this database and then categorized in 14 subfields according to experts opinions of the field. Impact Fact...
متن کاملComputation of unirational fields (extended abstract)
In this paper we present an algorithm for computing all algebraic intermediate subfields in a separably generated unirational field extension (which in particular includes the zero characteristic case). One of the main tools is Gröbner bases theory, see [BW93]. Our algorithm also requires computing computing primitive elements and factoring over algebraic extensions. Moreover, the method can be...
متن کاملComputation of Unirational Fields
One of the main contributions which Volker Weispfenning made to mathematics is related to Gröbner bases theory. In this paper we present an algorithm for computing all algebraic intermediate subfields in a separably generated unirational field extension (which in particular includes the zero characteristic case). One of the main tools is Gröbner bases theory. Our algorithm also requires computi...
متن کاملReducing Hardware Complexity of Wallace Multiplier Using High Order Compressors Based on CNTFET
Multiplier is one of the important components in many systems such as digital filters, digital processors and data encryption. Improving the speed and area of multipliers have impact on the performance of larger arithmetic circuits that are part of them. Wallace algorithm is one of the most famous architectures that uses a tree of half adders and full adders to increase the speed and red...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1606.01140 شماره
صفحات -
تاریخ انتشار 2016